/**
 * Copyright (c) 2009/09-2012/08, Regents of the University of Colorado
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright notice, this
 *    list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
/**
 * Copyright 2012/09-2013/04, University of Massachusetts Amherst
 * Copyright 2013/05-Present, IPSoft Inc.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *     http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License. 
 */
package com.googlecode.clearnlp.experiment;

import java.io.PrintStream;

import com.googlecode.clearnlp.constituent.CTNode;
import com.googlecode.clearnlp.constituent.CTTree;
import com.googlecode.clearnlp.propbank.PBInstance;
import com.googlecode.clearnlp.propbank.PBLib;
import com.googlecode.clearnlp.util.UTOutput;


public class PBExtract
{
	public PBExtract(String propFile, String treeDir, String outFile)
	{
		PrintStream fout = UTOutput.createPrintBufferedFileStream(outFile);
		
		for (PBInstance instance : PBLib.getPBInstanceList(propFile, treeDir, false))
		{
			if (instance.getArgSize() < 2)	continue;
			
			StringBuilder build = new StringBuilder();
			CTTree tree = instance.getTree();
			
			build.append(instance.treePath);	build.append("\t");
			build.append(instance.treeId);		build.append("\t");
			build.append(instance.predId);		build.append("\t");
			build.append(instance.roleset);		build.append("\t");
			build.append(tree.getTerminal(instance.predId).getTokenId());
			build.append("\t");
			build.append(getRawLine(tree, instance.predId));
			
			fout.println(build.toString());
		}
		
		fout.close();
	}
	
	private String getRawLine(CTTree tree, int predId)
	{
		StringBuilder build = new StringBuilder();
		
		for (CTNode node : tree.getTokens())
		{
			build.append(" ");
			
			if (node.getTerminalId() == predId)
			{
				build.append("[");
				build.append(node.form);
				build.append("]");
			}
			else
				build.append(node.form);
		}
		
		return build.substring(1);
	}

	public static void main(String[] args)
	{
		String propFile = args[0];
		String treeDir  = args[1];
		String outFile  = args[2];
		
		new PBExtract(propFile, treeDir, outFile);
	}

}
